Wireless Area Network Infrastructure Model on Gili Ketapang Island Using Open Shortest Path First Routing Protocol
نویسندگان
چکیده
This study aims to model the network for archipelago and tourism on Gili Ketapang. The implemented is a wireless WAN infrastructure meet needs of reliable tourist area. implements DHCP OSPF as routing protocol. methodology used perform simulations using packet tracer in designing through several scenarios with parameters assessing delay loss. At time implementation, it began cluster area number business units spread across each hamlet. design utilizes OSPF, DHCP, resulting most considerable 0.021 loss less than 3% so that included excellent category. implementation results protocol, paths do not go shortest path because they have backbone area, but link-state, cost meager path.
منابع مشابه
Open shortest path first routing under random early detection
In this paper we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we consider in this paper we only require a single network path be available between each origin and destination, a simplification of the OSPF protocol. We formulate a mixed integer nonlinea...
متن کاملDesign of Open Shortest Path First Protocol –a Link State Protocol Using Opnet Modular
Open Shortest Path First (OSPF) is an Interior Gateway Routing Protocol, based on Shortest Path First (SPF) or link-state technology. Open Shortest Path First (OSPF) is a link state routing protocol which was first defined as version 2 in RFC 2328. This is used to allow routers to dynamically learn routes from other routers and to advertise routes to other routers. OSPF router keeps track of th...
متن کاملA Neuro Fuzzy based conditional shortest path routing protocol for wireless mesh network
A modified nuero fuzzy based conditional shortest path routing protocol for wireless mesh network is simulated and studied. In wireless mesh networks many routing protocols used for conditional shortest path routing like AODV, by considering only the shortest route to destination .The data transfer in wireless mesh networks is to and from the AP. These protocol congested the routes and overload...
متن کاملAvoiding Ties in Shortest Path First Routing
First we discuss problems associated with ties and flow splitting with shortest path first protocols such as OSPF and IS-IS. The problems relate to uncertainty in the splitting when there are multiple shortest path from a source to a destination. Even if routers are configured for even splitting, there can easily be unpredicted biases that can overload links and thereby affect quality of servic...
متن کاملShortest Path Routing Algorithm for Hierarchical Interconnection Network-on-Chip
Interconnection networks play a significant role in efficient on-chip communication for multicore systems. This paper introduces a new interconnection topology called the Hierarchical Cross Connected Recursive network (HCCR) and a shortest path routing algorithm for the HCCR. Proposed topology offers a high degree of regularity, scalability, and symmetry with a reduced number of links and node ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kinetik : game technology, information system, computer network, computing, electronics, and control
سال: 2022
ISSN: ['2503-2259', '2503-2267']
DOI: https://doi.org/10.22219/kinetik.v7i1.1373